Protected Packet Routing: Achieving Fast Failure Recovery in the IP Layer

نویسندگان

  • Kang Xi
  • Jonathan Chao
  • H. Jonathan Chao
چکیده

Failure recovery in IP networks has gained much attention from both academic and industrial circles. The main challenge of this issue is how to achieve fast recovery while keep the implementation complexity and resource requirement at low level. Current IP networks rely on either routing table recalculation or lower layer protection for failure recovery. Although resource-efficient, routing recalculation takes seconds even minutes to complete. On the other hand, lower layer protection requires much redundant resource to achieves the speed of millisecond recovery. This paper proposes a pure IP layer scheme to achieve fast failure recovery with neither redundant resource reservation nor routing recalculation on the fly, called protected packet routing (PPR). The idea is to include a protection output port in each entry of the routing tables. Once a failure occurs, a number of routers switch to their protection ports for packet forwarding, thus bypass the failed equipment automatically. The challenges of this approach are: 1. Is a single protection port always sufficient to guarantee failure recovery? 2. How to find such ports? 3. How to coordinate the routers for failure recovery without little signaling? 4. How to realize distributed implementation? Focusing on single-link and single-node failure scenarios, this paper provides answers to the above questions and presents the performance evaluation of the proposed algorithms. Based on this work, it is promising to study double-failure scenario such that the survivability of IP networks can be intensified to tolerate the majority of network failures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable services with fast protection in IP/MPLS over optical networks

We define new quality-of-service (QoS) routing schemes with protection in Internet Protocol (IP)/Multiprotocol Label Switching (MPLS) over optical networks. The novelty of the proposed routing schemes is the use of the knowledge of the logical links already protected by the optical layer. The logical topology defined by the optical layer is given and fixed, and we assume that it is partially pr...

متن کامل

Multi-layer Network Recovery: Avoiding Traffic Disruptions Against Fiber Failures

The next generation backbone networks, optical IP/MPLS networks, enable increasingly higher volumes of information to be transported. In this network architecture, a fiber failure can result in a loss of several terabits of data per second and leads to multiple failures in the upper network layer. Thus, the ability of the network to maintain an acceptable level of reliability has become crucial...

متن کامل

IP Fast Rerouting for Double-Link Failure Recovery

Failure recovery in the IP layer using fast rerouting has gained much attention recently. When a failure occurs, the scheme let each router forward the affected packets to a pre-determined neighbor such that a set of recovery paths excluding the failed link/node are formed. Since the rerouting calculation and configuration are performed in advance, the recovery features short reaction time, sta...

متن کامل

Packet Handling Scheduling in Multiple Routing Configurations for Fast Ip Network Recovery

As a promising approach to improve network reliability, Proactive Failure Recovery (PFR) [1] reroutes failure affected traffic to backup paths without waiting for the completion of IP routing convergence. However, the failure affected traffic may cause congestion. If a proper scheduling policing mechanism is not used when a router redirect the traffic to alternative paths an overflow of packets...

متن کامل

Communication Networks Efficiency of routing and resilience mechanisms in packet-switched communication networks

In this work we compare the efficiency of various routing and resilience mechanisms. Their path layout determines the utilization of links in the network under normal operation and in failure scenarios. For the comparison, the performance measure is the maximum utilization ρS of all links for a set of protected failures S. A routing mechanism is considered more efficient than another if it lead...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007